Speeding Strings
نویسنده
چکیده
There is a class of single trace operators in N = 4 Yang-Mills theory which are related by the AdS/CFT correspondence to classical string solutions. Interesting examples of such solutions corresponding to periodic trajectories of the Neumann system were studied recently. In our paper we study a generalization of these solutions. We consider strings moving with large velocities. We show that the worldsheet of the fast moving string can be considered as a perturbation of the degenerate worldsheet, with the small parameter being the relativistic factor √ 1− v. The series expansion in this relativistic factor should correspond to the perturbative expansion in the dual Yang-Mills theory. The operators minimizing the anomalous dimension in the sector with given charges correspond to periodic trajectories in the mechanical system which is closely related to the product of two Neumann systems. e-mail: [email protected]
منابع مشابه
Computing Similarity between Rna Strings 1
Ribonucleic acid (RNA) strings are strings over the four-letter alphabet fA; C; G; Ug with a secondary structure of base-pairing between A 0 U and C 0 G pairs in the string. Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of t...
متن کاملComputing Similarity between RNA Strings
Ribonucleic acid (RNA) strings are strings over the four-letter alphabet {A, C, G, U} with a secondary structure of base-pairing between A U and C G pairs in the string 1 . Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of th...
متن کاملFrom Ternary Strings to Wiener Indices of Benzenoid Chains
An explicit, non-recursive formula for the Wiener index of any given benzenoid chain is derived, greatly speeding up calculations and rendering it manually manageable, through a novel envisioning of chains as ternary strings. Previous results are encompassed and two completely new and useful ones are obtained, a formula to determine Wiener indices of benzenoid chains in periodic patterns, and a...
متن کامل\recent Methods for Rna Modeling Using Stochastic Context-free Grammars," Proc. Combinatorial Pattern
Ribonucleic acid (RNA) strings are strings over the four-letter alphabet fA;C;G;Ug with a secondary structure of base-pairing between A U and C G pairs in the string 1 . Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of the s...
متن کاملSpeeding up the cyclic edit distance using LAESA with early abandon
The cyclic edit distance between two strings is the minimum edit distance between one of this strings and every possible cyclic shift of the other. This can be useful, for example, in image analysis where strings describe the contour of shapes or in computational biology for classifying circular permuted proteins or circular DNA/RNA molecules. The cyclic edit distance can be computed in O(mn lo...
متن کاملSpeeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings instead of just its length. The first algorithm is an improvement of Hirschberg’s divide-and-conquer algorithm. The second algorithm is an improvement of Hunt-Szymanski algorithm based on an efficient computation of all dominant match points. These two algorithms use bit-vector operat...
متن کامل